EVOLUTIONARY ALGORITHMS FOR RESOURCE CONSTRAINED NON-SERIAL MIXED FLOW SHOPS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Algorithms For Resource Constrained Non-Serial Mixed Flow Shops

In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investig...

متن کامل

Evolutionary Algorithms for Solving Resource Constrained Scheduling Problem

This paper investigates the use of evolutionary algorithms for solving resource constrained scheduling problem. This problem is in the class of NP complete problems. It involves finding optimal sequence of activities with given resource constraints. Evolutionary algorithms used in this paper are genetic algorithms and genetic programming, for which an adequate scheduling mechanism is defined. P...

متن کامل

OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS

Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...

متن کامل

An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm

In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...

متن کامل

Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths

Resource constrained shortest path problems are usually solved by label algorithms, which consist in a smart enumeration of the non-dominated paths. Recent improvements of these algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Intelligence and Applications

سال: 2003

ISSN: 1469-0268,1757-5885

DOI: 10.1142/s1469026803001105